Learning to Predict Charges for Criminal Cases with Legal Basis

The charge prediction task is to determine appropriate charges for a given case, which is helpful for legal assistant systems where the user input is fact description. We argue that relevant law articles play an important role in this task, and therefore propose an attention-based neural network method to jointly model the charge prediction task and the relevant article extraction task in a unified framework. The experimental results show that, besides providing legal basis, the relevant articles can also clearly improve the charge prediction results, and our full model can effectively predict appropriate charges for cases with different expression styles.Comment: 10 pages, accepted by EMNLP 201

Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis

The approximation ratio has become one of the dominant measures in mechanism design problems. In light of analysis of algorithms, we define the smoothed approximation ratio to compare the performance of the optimal mechanism and a truthful mechanism when the inputs are subject to random perturbations of the worst-case inputs, and define the average-case approximation ratio to compare the performance of these two mechanisms when the inputs follow a distribution. For the one-sided matching problem, Filos-Ratsikas et al. [2014] show that, amongst all truthful mechanisms, random priority achieves the tight approximation ratio bound of Theta(sqrt{n}). We prove that, despite of this worst-case bound, random priority has a constant smoothed approximation ratio. This is, to our limited knowledge, the first work that asymptotically differentiates the smoothed approximation ratio from the worst-case approximation ratio for mechanism design problems. For the average-case, we show that our approximation ratio can be improved to 1+e. These results partially explain why random priority has been successfully used in practice, although in the worst case the optimal social welfare is Theta(sqrt{n}) times of what random priority achieves. These results also pave the way for further studies of smoothed and average-case analysis for approximate mechanism design problems, beyond the worst-case analysis

Online Muscle Activation Onset Detection Using Likelihood of Conditional Heteroskedasticity of Electromyography Signals

Surface electromyography (sEMG) signals are crucial in developing human-machine interfaces, as they contain rich information about human neuromuscular activities. &lt;italic&gt;Objective:&lt;/italic&gt; The real-time, accurate detection of muscle activation onset (MAO) is significant for EMG-triggered control strategies in embedded applications like prostheses and exoskeletons. &lt;italic&gt;Methods:&lt;/italic&gt; This paper investigates sEMG signals using the generalized autoregressive conditional heteroskedasticity (GARCH) model, focusing on variance. A novel feature, the likelihood of conditional heteroskedasticity (LCH) extracted from the maximum likelihood estimation of GARCH parameters, is proposed. This feature effectively distinguishes signal from noise based on heteroskedasticity, allowing for the detection of MAO through the LCH feature and a basic threshold classifier. For online calculation, the model parameter estimation is simplified, enabling direct calculation of the LCH value using fixed parameters. &lt;italic&gt;Results:&lt;/italic&gt; The proposed method was validated on two open-source datasets and demonstrated superior performance over existing methods. The mean absolute error of onset detection, compared with visual detection results, is approximately 65 ms under online conditions, showcasing high accuracy, universality, and noise insensitivity. &lt;italic&gt;Conclusion:&lt;/italic&gt; The results indicate that the proposed method using the LCH feature from the GARCH model is highly effective for real-time detection of muscle activation onset in sEMG signals. &lt;italic&gt;Significance:&lt;/italic&gt; This novel approach shows great potential and possibility for real-world applications, reflecting its superior performance in accuracy, universality, and insensitivity to noise.</p

Bending vibration prediction of orthotropic plate with wave-based method

A novel numerical predictive approach for steady-state response of thin orthotropic plate is presented based on wave-based method (WBM) that is applied in bending vibration prediction of thin and thick plate in mid-frequency range. The wavenumber parameters for orthotropic material and the particular solution of an infinite orthotropic plate with Fourier transform are derived. The proposed method is validated by numerical examples with simply supported boundary and clamped boundary. The compared result shows that the computational accuracy and efficiency of WBM is significantly higher than element based method, which is the ability of WBM for mid-frequency problems. The predictive ability of WBM is extended to process the dynamic response of orthotropic plate

One size does not fit all : accelerating OLAP workloads with GPUs

GPU has been considered as one of the next-generation platforms for real-time query processing databases. In this paper we empirically demonstrate that the representative GPU databases [e.g., OmniSci (Open Source Analytical Database & SQL Engine,, 2019)] may be slower than the representative in-memory databases [e.g., Hyper (Neumann and Leis, IEEE Data Eng Bull 37(1):3-11, 2014)] with typical OLAP workloads (with Star Schema Benchmark) even if the actual dataset size of each query can completely fit in GPU memory. Therefore, we argue that GPU database designs should not be one-size-fits-all; a general-purpose GPU database engine may not be well-suited for OLAP workloads without careful designed GPU memory assignment and GPU computing locality. In order to achieve better performance for GPU OLAP, we need to re-organize OLAP operators and re-optimize OLAP model. In particular, we propose the 3-layer OLAP model to match the heterogeneous computing platforms. The core idea is to maximize data and computing locality to specified hardware. We design the vector grouping algorithm for data-intensive workload which is proved to be assigned to CPU platform adaptive. We design the TOP-DOWN query plan tree strategy to guarantee the optimal operation in final stage and pushing the respective optimizations to the lower layers to make global optimization gains. With this strategy, we design the 3-stage processing model (OLAP acceleration engine) for hybrid CPU-GPU platform, where the computing-intensive star-join stage is accelerated by GPU, and the data-intensive grouping & aggregation stage is accelerated by CPU. This design maximizes the locality of different workloads and simplifies the GPU acceleration implementation. Our experimental results show that with vector grouping and GPU accelerated star-join implementation, the OLAP acceleration engine runs 1.9x, 3.05x and 3.92x faster than Hyper, OmniSci GPU and OmniSci CPU in SSB evaluation with dataset of SF = 100.Peer reviewe